(t,n) multi-secret sharing scheme extended from Harn-Hsu’s scheme
نویسندگان
چکیده
منابع مشابه
Dynamic Multi-Secret Sharing Scheme
Secret sharing schemes are very important techniques for the key management. To provide more efficient and flexible alternatives for the applications of secret sharing, this paper presents a dynamic multi-secret sharing scheme. A significant characteristic of the proposed scheme is that each participant has to keep only one master secret share which can be used to reconstruct different group se...
متن کاملOn Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is m times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only...
متن کاملA practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on ...
متن کاملCRT Based Threshold Multi Secret Sharing Scheme
This paper presents a novel secret sharing system that is based on Chinese remainder theorem. This scheme deals with a concept of multiple secrets to be shared to different groups, such that each group receives shares of secret intended for it. The sharing is a threshold scheme, that is more than a fixed number of members from any particular group, will be able to reconstruct the secret and any...
متن کاملA Novel Proactive Multi-secret Sharing Scheme
A proactive secret sharing scheme is a method of sharing a secret among a set of participants. And, the corresponding shadows can be periodically renewed under the premise of never changing the shared secret. However, in the most existing proactive secret sharing schemes, only one secret can be shared during one secret sharing process. The proposed scheme describes PMSS, a new way to share mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2018
ISSN: 1687-1499
DOI: 10.1186/s13638-018-1086-5